
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 1664. -- [Usaco2006 Open]County Fair Events -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>1664: [Usaco2006 Open]County Fair Events</h2><span class=green>Time Limit: </span>5 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>64 MB<br><span class=green>Submit: </span>104&nbsp;&nbsp;<span class=green>Solved: </span>68<br>[<a href='submitpage.php?id=1664'>Submit</a>][<a href='problemstatus.php?id=1664'>Status</a>][<a href='bbs.php?id=1664'>Discuss</a>]</center><h2>Description</h2><div class=content>Farmer John has returned to the County Fair so he can attend the
special events (concerts, rodeos, cooking shows, etc.). He wants
to attend as many of the N (1 <= N <= 10,000) special events as he
possibly can.

He's rented a bicycle so he can speed from one event to the next
in absolutely no time at all (0 time units to go from one event to
the next!).

Given a list of the events that FJ might wish to attend, with their
start times (1 <= T <= 100,000) and their durations (1 <= L <=
100,000), determine the maximum number of events that FJ can attend.
FJ never leaves an event early.

有N个节日
每个节日有个开始时间,及持续时间.
牛想尽可能多的参加节日,问最多可以参加多少.
注意牛的转移速度是极快的,不花时间.
</div><h2>Input</h2><div class=content>* Line 1: A single integer, N.

* Lines 2..N+1: Each line contains two space-separated integers, T and
        L, that describe an event that FJ might attend.

</div><h2>Output</h2><div class=content>* Line 1: A single integer that is the maximum number of events FJ can
        attend.
</div><h2>Sample Input</h2>
			<div class=content><span class=sampledata>7               <br />
1 6<br />
8 6<br />
14 5<br />
19 2<br />
1 8<br />
18 3<br />
10 6<br />
<br />
INPUT DETAILS:<br />
<br />
Graphic picture of the schedule:<br />
         11111111112<br />
12345678901234567890---------这个是时间轴.<br />
--------------------<br />
111111 2222223333344<br />
55555555 777777  666<br />
<br />
这个图中1代表第一个节日从1开始,持续6个时间,直到6.<br />
<br />
</span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>4<br />
<br />
OUTPUT DETAILS:<br />
<br />
FJ can do no better than to attend events 1, 2, 3, and 4.</span></div><h2>HINT</h2>
			<div class=content><p></p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search=Silver'>Silver</a></p></div><center>[<a href='submitpage.php?id=1664'>Submit</a>][<a href='problemstatus.php?id=1664'>Status</a>][<a href='bbs.php?id=1664'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
